Uncapacitated and Capacitated Facility Location Problems
نویسنده
چکیده
The uncapacitated facility location problem ( UFLP) involves locating an undetermined number of facilities to minimize the sum of the (annualized) fixed setup costs and the variable costs of serving the market demand from these facilities. UFLP is also known as the “simple” facility location problem SFLP, where both the alternative facility locations and the customer zones are considered discrete points on a plane or a road network. This assumes that the alternative sites have been predetermined and the demand in each customer zone is concentrated at the point representing that region. UFLP focuses on the production and distribution of a single commodity over a single time period (e.g., one year that is representative of the firm’s long-run demand and cost structure), during which the demand is assumed to be known with certainty. The distinguishing feature of this basic discrete location problem, however, is the decision maker’s ability to determine the size of each facility without any budgetary, technological, or physical restrictions. Krarup and Pruzan (1983) provided a comprehensive survey of the early literature on UFLP, including its solution properties. By demonstrating the relationships between UFLP and the set packing-covering-partitioning problems, they established its NP-completeness. The seminal paper of Erlenkotter (1978), which is reviewed in Sect. 2.2 of this chapter, presents a dual-based algorithm for solving the UFLP that remains as one of the most efficient solution techniques for this problem. Prior to Erlenkotter (1978), the best-known approaches for solving the UFLP were the branch-and-bound algorithm developed by Efroymson and Ray (1966) and the implicit enumeration technique of Spielberg (1969). Efroymson and Ray (1966) use a compact formulation of UFLP to take advantage of the fact that its linear programming relaxation can be solved by inspection. Nonetheless, this linear programming relaxation does not provide tight lower bounds for UFLP; Efroymson and Ray’s model is therefore Chapter 2 Uncapacitated and Capacitated Facility Location Problems
منابع مشابه
Dynamic multi-level capacitated and uncapacitated location problems: an approach using primal-dual heuristics
In this paper several dynamic multi-level location problems are formulated as mixed-integer linear programs. Both uncapacitated and capacitated versions of the problem are studied. The models presented are more complete than the ones known from the literature: they are dynamic and consider the possibility of a facility being open, closed and reopen more than once during the planning horizon. Th...
متن کاملApproximation Algorithms for Metric Facility Location Problems
In this paper we present a 1.52-approximation algorithm for the metric uncapacitated facility location problem, and a 2-approximation algorithm for the metric capacitated facility location problem with soft capacities. Both these algorithms improve the best previously known approximation factor for the corresponding problem, and our soft-capacitated facility location algorithm achieves the inte...
متن کاملApproximation algorithms for Capacitated Facility Location Problem with Penalties
In this paper, we address the problem of capacitated facility location problem with penalties (CapFLPP) paid per unit of unserved demand. In case of uncapacitated FLP with penalties demands of a client are either entirely met or are entirely rejected and penalty is paid. In the uncapacitated case, there is no reason to serve a client partially. Whereas, in case of CapFLPP, it may be beneficial ...
متن کاملLocal Search Heuristics for Facility Location Problems
In this thesis, we develop approximation algorithms for facility location problems based on local search techniques. Facility location is an important problem in operations research. Heuristic approaches have been used to solve many variants of the problem since the 1960s. The study of approximation algorithms for facility location problems started with the work of Hochbaum. Although local sear...
متن کاملHeuristic Methods Based on MINLP Formulation for Reliable Capacitated Facility Location Problems
This paper addresses a reliable facility location problem with considering facility capacity constraints. In reliable facility location problem some facilities may become unavailable from time to time. If a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. Hence, the fail of facilities leads to disruptions in facility location dec...
متن کامل